-
1 complete homomorphism
Большой англо-русский и русско-английский словарь > complete homomorphism
-
2 complete homomorphism
Математика: полный гомоморфизм -
3 complete homomorphism
мат.English-Russian scientific dictionary > complete homomorphism
-
4 lower complete homomorphism
Математика: полный снизу гомоморфизмУниверсальный англо-русский словарь > lower complete homomorphism
-
5 lower complete homomorphism
English-Russian scientific dictionary > lower complete homomorphism
-
6 homomorphism
гомоморфизм, гомоморфное отображение- locally nilpotent homomorphism - locally rigid homomorphism - lower complete homomorphism - lower semicomplete homomorphism - monic homomorphism - retractive homomorphism -
7 полный гомоморфизм
complete homomorphism мат., entire homomorphismРусско-английский научно-технический словарь Масловского > полный гомоморфизм
-
8 полный гомоморфизм
Большой англо-русский и русско-английский словарь > полный гомоморфизм
-
9 полный гомоморфизм
Mathematics: complete homomorphism, entire homomorphismУниверсальный русско-английский словарь > полный гомоморфизм
-
10 полный снизу гомоморфизм
Mathematics: lower complete homomorphismУниверсальный русско-английский словарь > полный снизу гомоморфизм
-
11 полный снизу гомоморфизм
Русско-английский научно-технический словарь Масловского > полный снизу гомоморфизм
-
12 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
-
13 kernel
1) зерно, зёрнышко2) керн3) матем. кернфункция4) сердцевина; ядро•kernel on the left — алг. ядро слева
kernel on the right — алг. ядро справа
kernel with a summable square — алг. ядро с суммируемым квадратом
- intrinsically singular kernel - kernel of a linear operator - kernel of a singular integral - kernel of a summation method - kernel of integral operator - kernel of integral transformation - locally finite kernel - nonpositive definite kernel - proper covariance kernelkernel with a weak singularity — алг. ядро со слабой особенностью
-
14 law
1) закон3) правило4) принцип•under the law — по закону, согласно закону, в соответствии с законом
- Biot law- converse law of double negation- cube law- distributive law of disjunction over conjunction - double law of the mean - fifth power law - first distributive law - first law of mean- gas law- idempotency law - infinitely decomposable law - infinitely divisible law - inverse sine law - inverse square law - law of addition of probability - law of alteration of quantifiers - law of associativity of disjunction - law of comparative judgment - law of constant angles - law of double complementation - law of equal significance - law of mass action - law of random function - law of random vector - law of requisite variety - law of right invertibility - law of statistical regularity - law of universal causation - law of universal gravitation - Newton's first law of motion - Newton's law of gravitation - Newton's second law of motion - Newton's third law of motion - normal law of composition - normal law of errors - one-sided modular law - probabilistic law - probability law - product law of probability - quadratic reciprocity law - second law of mean - second order law - similitude law- time law- weak law
См. также в других словарях:
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Complete Heyting algebra — In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra which is complete as a lattice. Complete Heyting algebras are the objects of three different categories; the category CHey, the category Loc of locales,… … Wikipedia
Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) … Wikipedia
Complete group — In mathematics, a group G is said to be complete if every automorphism of G is inner, and the group is a centerless group; that is, it has a trivial outer automorphism group and trivial center. Equivalently, a group is complete if the conjugation … Wikipedia
Graph homomorphism — Not to be confused with graph homeomorphism. In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. Contents 1… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Completely distributive lattice — In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets. Formally, a complete lattice L is said to be completely distributive if, for any doubly… … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia